A Low-Power Design for Reed-Solomon Decoders
نویسندگان
چکیده
In this paper, a low-power design for the Reed-Solomon (RS) decoder is presented. Our approach includes a novel two-stage syndrome calculator that reduces the syndrome computations by one-half, a modified Berlekamp-Massey algorithm in the key equation solver and a terminated mechanism in the Chien search circuit. The test chip for (255, 239) and (208, 192) RS decoders are implemented by 0.25 μm CMOS 1P5M and 0.35 μm CMOS SPQM standard cells, respectively. Simulation results show our approach can work successfully and achievea large reduction of power consumption on the average.
منابع مشابه
A Universal Reed-Solomon Decoder
Two architecturesfor universal Reed-Solomon decoders are given. These decoders, called time-domain decoders, work directly on the raw data word as received without the usual syndrome calculation or power-sum-symmetric functions Up to the limitations of the working registers, the decoders can decode any Reed-Solomon codeword or BCH codeword in the presence of both errors and erasures. Provision ...
متن کاملOn the Average Complexity of Reed-Solomon Algebraic List Decoders
We study the error dependent interpolation cost of Reed-Solomon (RS) list-decoders. Words corrupted by low weight errors require lower degree interpolation polynomials. By giving different upper bounds we quantitatively link the interpolation cost to the weight of the instantaneous channel error. To take advantage of this phenomenon, we propose modifications to interpolation algorithms that tra...
متن کاملAn area-efficient architecture for Reed-Solomon decoder using the inversionless decomposed Euclidean algorithm
We propose a new area-efficient architecture to implement the Euclidean algorithm. which is frequently used in BCH and Reed-Solomon decoders. For Reed-Solomon decoders, our architecture can be applied to the correction of errors as well as erasures. An iriversioizless decomposed Euclidean algorithni is adopted which not only eliminates the finitefield inverter (FFI) but also introduces an effic...
متن کاملA Versatile Time-Domain Reed-Solomon Decoder
A versatile Reed-Solomon (RS) decoder structure is developed based on the time-domain decoding algorithm (transform decoding without transforms). In this paper, the algorithm is restructured and a method is given to decode any RS code generated by any generator polynomial. The main advantage of the introduced decoder structure is the versatility. By versatile decoder we mean a decoder that can ...
متن کاملAlgorithm-Based Low-Power/High-Speed Reed–Solomon Decoder Design
With the spread of Reed–Solomon (RS) codes to portable wireless applications, low-power RS decoder design has become important. This paper discusses how the Berlekamp Massey Decoding algorithm can be modified and mapped to obtain a low-power architecture. In addition, architecture level modifications that speed-up the syndrome and error computations are proposed. Then the VLSI architecture and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Circuits, Systems, and Computers
دوره 12 شماره
صفحات -
تاریخ انتشار 2003